Stochastic Based Pre-emptive Planning and Scheduling

نویسندگان

  • Peter Matthews
  • Graham Coates
چکیده

This paper describes a significant revision to the Concurrent Engineering (CE) methodology that enables a shortened project completion time. Under the CE methodology, sequential tasks can only be performed as such. We introduce a method for starting sequential tasks concurrently using a pre-emptive approach. Where there are a, suitably small, finite number of possible alternative subsequent tasks, we propose that a more agile approach is to begin work on these alternative subsequent tasks concurrently to the preceding task, sharing the resource needed for the subsequent task amongst the different alternatives. Further, where the probability for each alternative task is known, we demonstrate that by setting the resource allocation equal to the probabilities of each outcome, it is possible dynamically allocate resources to minimise the expected completion of the overall project. A simple classically sequential two task case study is developed and analysed to illustrate this method. The paper concludes by revisiting the original assumptions and discussing how resource efficiency is traded off for minimising project completion time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Short-term Price-based Unit Commitment of Hydrothermal GenCos: A Pre-emptive Goal Programming Approach

The solution of single-objective unit commitment problems for generation companies participating in deregulated markets may not directly be implementable mainly because of neglecting some conflicting secondary objectives arising from policy-making at internal/external environment. Benefiting an efficient multi-objective approach to improve the applicability of price-based unit commitment soluti...

متن کامل

Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited

In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS). We show that both the existing global and local schedulability analysis are pessimistic, present improved analysis, and illustrat...

متن کامل

Pre-emptive Resource-constrained Project Scheduling with Setup Times

Resource-constrained project scheduling with activity pre-emption assumes that activities are allowed to be interrupted and restarted later in the schedule at no extra cost. In the current paper, we extend this pre-emptive scheduling problem with setup times between activity interruptions and the possibility to fast track pre-emptive subparts of activities. The contribution of the paper is twof...

متن کامل

Global Fixed Priority Scheduling with Deferred Pre-emption Revisited

This paper introduces schedulability analysis for global fixed priority scheduling with deferred pre-emption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved via appropriate choice of priority assignment and final non...

متن کامل

On Optimal Priority Assignment for Response Time Analysis of Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Hard Real-Time Systems

This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. Previous work in this area showed that arguably the most effective pseudo-polynomial schedulability tests for global fixed priority pre-emptive scheduling, based on response time analysis, are not compatible with Audsley’s Optimal Priori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014